A static scheduling generator for the deployment of a component based application
نویسندگان
چکیده
This paper proposes a static scheduling of an application designed using the IEC 61499 standard. In this standard, a function block (FB) is an event triggered component and an application is a FBs network. According to specifications, we propose temporal constraints on the application behavior. To verify these constraints, we propose to transform the application blocks into a particular tasks system with precedence constraints. The purpose is to exploit previous works on scheduling. In addition, we propose a schedulability analysis generating an accessibility graph of the application. This graph allows the construction of a static scheduling to use by a sequencer at run-time.
منابع مشابه
An application of principal component analysis and logistic regression to facilitate production scheduling decision support system: an automotive industry case
Production planning and control (PPC) systems have to deal with rising complexity and dynamics. The complexity of planning tasks is due to some existing multiple variables and dynamic factors derived from uncertainties surrounding the PPC. Although literatures on exact scheduling algorithms, simulation approaches, and heuristic methods are extensive in production planning, they seem to be ineff...
متن کاملAn Efficient Extension of Network Simplex Algorithm
In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...
متن کاملScheduling in Container Terminals using Network Simplex Algorithm
In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by the Network Simplex Algorithm (NSA). The algorithm is based on graph model and their performances are at least 100 times faster than traditional si...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملInduction Motor Electric Parameters Estimation Using Artificial Neural Networkds and its Application in industrial Load Modeling
Load modeling is widely used in power system studies. Two types of modeling, namely, static and dynamic, are employed. The current industrial practice is the static modeling. Static modelss are algebraic equations of active and reactive power changes in terms of voltage and frequency deviations. In this paper, a component based on static modeling is employed in which the aggregate model is deri...
متن کامل